comparison between tikhonov regularization and truncated svd in gravity data inversion

نویسندگان

وحید ابراهیم زاده اردستانی

استاد موسسه ژئوفیزیک سعید وطن خواه

دانشگاه تهران رضوان سلطان آبادی

دانشجوی موسسه ژئوفیزیک

چکیده

in this paper the 3d inversion of gravity data using two different regularization methods, namely tikhonov regularization and truncated singular value decomposition (tsvd), is considered. the earth under the survey area is modeled using a large number of rectangular prisms, in which the size of the prisms are kept fixed during the inversion and the values of densities of the prisms are the model parameters to be determined. a depth weighting matrix is used to counteract the natural decay of the kernel, so the inversion obtains reliable information about the source distribution with respect to depth. to generate a sharp and focused model, the minimum support (ms) constraint is used, which minimizes the total area with non zero departure of the model parameters from a given a priori model. then, the application of iteratively reweighted least square algorithm is required to deal with non-linearity introduced by ms constraint. at each iteration of the inversion, a priori variable weighting matrix is updated using model parameters obtained at the previous iteration. we use the singular value decomposition (svd) for computing tikhonov solution, which also helps us to compare the results with the solution obtained by tsvd. thus, the algorithms presented here are suitable for small to moderate size problems, where it is feasible to compute the svd. in tikhonov regularization method, the optimal regularization parameter at each iteration is obtained by application of the parameter-choice method. the method is based on the statistical distribution of the minimum of the tikhonov function. for weighting of the data fidelity by a known gaussian noise distribution on the measured data and, when the regularization term is considered to be weighted by unknown inverse covariance information on the model parameters, the minimum of the tikhonov functional becomes a random variable that follows a  distribution. then, a newton root-finding algorithm can be used to find the regularization parameter. for truncated svd regularization, the picard plot is used to find a suitable value of truncation index. in math literature, a plot of singular values together with svd and solution coefficients is often referred to as picard plot. to test the algorithms, a density model which consists of a dipping dike embedded in a uniform half-space is used. the surface gravity anomaly produced by this model is contaminated with three different noise levels, and are used as input for introduced inversion algorithms. the results indicate that the algorithms are able to recover the geometry and density distribution of the original model. in general, the reconstructed model is more sparse using tsvd method as compare with tikhonov solution. this especially happens for high noise level, where there is an important difference between two solutions. in this case, while tsvd produces a sparse model, the solution of tikhonov regularization is not sparse. furthermore, the number of iterations, which is required to terminate the algorithms, is more for tsvd as compare with tikhonov method. this feature, along with automatic determination of regularization parameter, makes the implementation of the tikhonov regularization method faster than tsvd. the inversion methods are used on real gravity data acquired over the gotvand dam site in the south-west of iran. tertiary deposits of the gachsaran formation are the dominant geological structure in this area, and it is mainly comprised of marl, gypsum, anhydrite and halite. there are several solution cavities in the area so that relative negative anomalies are distinguishable in the residual map. a window of residual map consists of 640 gridded data, which includes three negative anomalies, that is selected for modeling. the reconstructed models are shown and compare with results obtained by bore holes.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Analysis of Non-negative Tikhonov and Truncated Singular Value Decomposition Regularization Inversion in Pcs

Considering non-negative characteristic of the particle size distribution (PSD), based on trust-regionreflective Newton method, two non-negative regularization methods of truncated singular value decomposition (TSVD) and Tikhonov (TIK) for photon correlation spectroscopy (PCS) are proposed in this paper. Combining two regularization parameter criterions of GCV and L-curve, two non-negative regu...

متن کامل

Automatic estimation of regularization parameter by active constraint balancing method for 3D inversion of gravity data

Gravity data inversion is one of the important steps in the interpretation of practical gravity data. The inversion result can be obtained by minimization of the Tikhonov objective function. The determination of an optimal regularization parameter is highly important in the gravity data inversion. In this work, an attempt was made to use the active constrain balancing (ACB) method to select the...

متن کامل

A comparison of truncated total least squares with Tikhonov regularization in imaging by ultrasound inverse scattering.

For good image quality using ultrasound inverse scattering, one alternately solves the well-posed forward scattering equation for an estimated total field and the ill-posed inverse scattering equation for the desired object property function. In estimating the total field, error or noise contaminates the coefficients of both matrix and data of the inverse scattering equation. Previous work on i...

متن کامل

Large-scale Inversion of Magnetic Data Using Golub-Kahan Bidiagonalization with Truncated Generalized Cross Validation for Regularization Parameter Estimation

In this paper a fast method for large-scale sparse inversion of magnetic data is considered. The L1-norm stabilizer is used to generate models with sharp and distinct interfaces. To deal with the non-linearity introduced by the L1-norm, a model-space iteratively reweighted least squares algorithm is used. The original model matrix is factorized using the Golub-Kahan bidiagonalization that proje...

متن کامل

3D gravity data-space inversion with sparseness and bound constraints

One of the most remarkable basis of the gravity data inversion is the recognition of sharp boundaries between an ore body and its host rocks during the interpretation step. Therefore, in this work, it is attempted to develop an inversion approach to determine a 3D density distribution that produces a given gravity anomaly. The subsurface model consists of a 3D rectangular prisms of known sizes ...

متن کامل

Comparison of Truncated SVD and Jacobi-Davidson SVD within ESVDMOR

The reduction of parasitic linear subcircuits is one of many issues in model order reduction (MOR) for VLSI design. This issue is well explored, but the structure of these subcircuits has been changing recently. So far, the number of elements in these subcircuits was significantly larger than the number of connections to the whole circuit, the so called pins or terminals. This assumption is no ...

متن کامل

منابع من

با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید


عنوان ژورنال:
فیزیک زمین و فضا

جلد ۴۲، شماره ۳، صفحات ۵۲۳-۵۳۴

کلمات کلیدی
in this paper the 3d inversion of gravity data using two different regularization methods namely tikhonov regularization and truncated singular value decomposition (tsvd) is considered. the earth under the survey area is modeled using a large number of rectangular prisms in which the size of the prisms are kept fixed during the inversion and the values of densities of the prisms are the model parameters to be determined. a depth weighting matrix is used to counteract the natural decay of the kernel so the inversion obtains reliable information about the source distribution with respect to depth. to generate a sharp and focused model the minimum support (ms) constraint is used which minimizes the total area with non zero departure of the model parameters from a given a priori model. then the application of iteratively reweighted least square algorithm is required to deal with non linearity introduced by ms constraint. at each iteration of the inversion a priori variable weighting matrix is updated using model parameters obtained at the previous iteration. we use the singular value decomposition (svd) for computing tikhonov solution which also helps us to compare the results with the solution obtained by tsvd. thus the algorithms presented here are suitable for small to moderate size problems where it is feasible to compute the svd. in tikhonov regularization method the optimal regularization parameter at each iteration is obtained by application of the parameter choice method. the method is based on the statistical distribution of the minimum of the tikhonov function. for weighting of the data fidelity by a known gaussian noise distribution on the measured data and when the regularization term is considered to be weighted by unknown inverse covariance information on the model parameters the minimum of the tikhonov functional becomes a random variable that follows a  distribution. then a newton root finding algorithm can be used to find the regularization parameter. for truncated svd regularization the picard plot is used to find a suitable value of truncation index. in math literature a plot of singular values together with svd and solution coefficients is often referred to as picard plot. to test the algorithms a density model which consists of a dipping dike embedded in a uniform half space is used. the surface gravity anomaly produced by this model is contaminated with three different noise levels and are used as input for introduced inversion algorithms. the results indicate that the algorithms are able to recover the geometry and density distribution of the original model. in general the reconstructed model is more sparse using tsvd method as compare with tikhonov solution. this especially happens for high noise level where there is an important difference between two solutions. in this case while tsvd produces a sparse model the solution of tikhonov regularization is not sparse. furthermore the number of iterations which is required to terminate the algorithms is more for tsvd as compare with tikhonov method. this feature along with automatic determination of regularization parameter makes the implementation of the tikhonov regularization method faster than tsvd. the inversion methods are used on real gravity data acquired over the gotvand dam site in the south west of iran. tertiary deposits of the gachsaran formation are the dominant geological structure in this area and it is mainly comprised of marl gypsum anhydrite and halite. there are several solution cavities in the area so that relative negative anomalies are distinguishable in the residual map. a window of residual map consists of 640 gridded data which includes three negative anomalies that is selected for modeling. the reconstructed models are shown and compare with results obtained by bore holes.

میزبانی شده توسط پلتفرم ابری doprax.com

copyright © 2015-2023